Vertex-primitive digraphs having vertices with almost equal neighbourhoods
نویسندگان
چکیده
منابع مشابه
Vertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملBlock Line Cut Vertex Digraphs of Digraphs
In this paper, the digraph valued function(digraph operator), namely the block line cut vertex digraph BLC(D) of a digraph D is defined, and the problem of reconstructing a digraph from its block line cut vertex digraph is presented. Outer planarity, maximal outer planarity, and minimally non-outer planarity properties of these digraphs are discussed.
متن کاملWell primitive digraphs
A primitive digraph D is said to be well primitive if the local exponents of D are all equal. In this paper we consider well primitive digraphs of two special types: digraphs that contain loops, and symmetric digraphs with shortest odd cycle of length r. We show that the upper bound of the exponent of the well primitive digraph is n− 1 in both these classes of digraphs, and we characterize the ...
متن کاملSpanning Trees with Vertices Having Large Degrees
Let G be a connected simple graph, and let f be a mapping from V (G) to the set of integers. This paper is concerned with the existence of a spanning tree in which each vertex v has degree at least f(v). We show that if ∣∣ΓG(S)∣∣− f(S)+ |S| ≥ 1 for any nonempty subset S ⊆ L, then a connected graph G has a spanning tree such that dT (x) ≥ f(x) for all x ∈ V (G), where ΓG(S) is the set of neighbo...
متن کاملVertex-symmetric Digraphs with Small Diameter
There is increasing interest in the design of dense vertex-symmetric graphs and digraphs as models of interconnection networks for implementing parallelism. In these systems many nodes are connected with relatively few links and short paths between them and each node may execute, without modifications, the same communication software. In this paper we give new families of dense vertex-symmetric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2017
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2016.11.002